A Two-Processor Scheduling Method for a Class of Program Nets with Unity Node Firing Time
نویسنده
چکیده
This paper deals with two-processor scheduling for a class of program nets, that are acyclic and SWITCH-less, and of which each node has unity node firing time. Firstly, we introduce a hybrid priority list L∗ that generates optimal schedules for the nets whose AND-nodes possess at most single input edge. Then we extend L∗ to suit for general program nets to give a new priority list L∗∗. Finally, we use genetic algorithm to do the performance evaluation for the schedules generated by L∗∗ and show these schedules are quite close to optimal ones. key words: program net, two-processor scheduling, hybrid priority list, genetic algorithm, performance evaluation
منابع مشابه
Two-Processor Scheduling of General Acyclic SWITCH-less Program Nets via Hybrid Priority Lists
This paper deals with two-processor scheduling for general acyclic SWITCH-less program nets with random node firing times. First, we introduce a hybrid priority list L∗ that has been shown to generate optimal schedules for the acyclic SWITCH-less program nets with unity node firing times, of which AND-nodes possess at most single input edge. Then considering the factors of existence of the AND-...
متن کاملPerformance Evaluation of a Two-Processor Scheduling Method for Acyclic SWITCH-less Program Nets
This paper investigates the usefulness of a new priority list for two-processor scheduling problem of program nets. Firstly, we discuss the weakness of a previously proposed priority list and then introduce a new priority list. Through simulation experiment we show that the new priority list is better than the previous one and can generate the same length of schedules as GA scheduling, which im...
متن کاملA Fast Implementation for Recurrent DSP Scheduling Using Final Matrix
The scheduling theory of Heemstra de Groot et al. is supplemented by extending the Final Matrixs usefulness beyond finding iteration bounds, critical loops and subcritical loops of recursive data flow graphs (RDFGs) to scheduling. DFG is a special case of Petri nets (PN). Hence we apply the cycle time theory of PN to the scheduling of DFG. Contributions include: (1) development of explicit for...
متن کاملTime Petri Nets with Dynamic Firing Dates: Semantics and Applications
We define an extension of time Petri nets such that the time at which a transition can fire, also called its firing date, may be dynamically updated. Our extension provides two mechanisms for updating the timing constraints of a net. First, we propose to change the static time interval of a transition each time it is newly enabled; in this case the new time interval is given as a function of th...
متن کاملHybrid Stochastic Petri Nets: Firing Speed Computation and Fms Modelling
In this paper we adopt the fluid approximation theory to describe the dynamic behavior of Flexible Manufacturing Systems that we model with Hybrid Stochastic Petri Nets, a class of nets in which some places may hold fluid rather than discrete tokens. The continuous transitions of the net are fired with speeds that are piecewise constants over the entire time horizon and their instantaneous valu...
متن کامل